The Multiple Steiner TSP with order constraints: complexity and optimization algorithms
نویسندگان
چکیده
منابع مشابه
Reliability optimization problems with multiple constraints under fuzziness
In reliability optimization problems diverse situation occurs due to which it is not always possible to get relevant precision in system reliability. The imprecision in data can often be represented by triangular fuzzy numbers. In this manuscript, we have considered different fuzzy environment for reliability optimization problem of redundancy. We formulate a redundancy allocation problem for a...
متن کاملAlgorithm selection for TSP with time constraints on the algorithms
The Travelling Salesman Problem (TSP) has been extensively studied in the literature and various solvers are available. However, none of the state-of-the-art solvers for TSP outperforms the others on all problem instances within a given time limit. Therefore, predicting the best performing algorithm for a particular instance is of a practical importance. In this paper, the TSP is studied in con...
متن کاملParticle swarm optimization-based algorithms for TSP and generalized TSP
A novel particle swarm optimization (PSO)-based algorithm for the traveling salesman problem (TSP) is presented. An uncertain searching strategy and a crossover eliminated technique are used to accelerate the convergence speed. Compared with the existing algorithms for solving TSP using swarm intelligence, it has been shown that the size of the solved problems could be increased by using the pr...
متن کاملOn the Iteration Complexity of Oblivious First-Order Optimization Algorithms
We consider a broad class of first-order optimization algorithms which are oblivious, in the sense that their step sizes are scheduled regardless of the function under consideration, except for limited side-information such as smoothness or strong convexity parameters. With the knowledge of these two parameters, we show that any such algorithm attains an iteration complexity lower bound of Ω( √...
متن کاملValidity Constraints and the TSP - GeneRepair of Genetic Algorithms
In this paper we present the outcome of a sets of experiments to evaluate the effectiveness of a new adjunct genetic operator GeneRepair. This operator was developed to correct invlaid tours which may be generated following crossover or mutation of our particular implementation of the genetic algorithm. Following implementation and testing of our genetic algotihm with GeneRepair we found a sign...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Soft Computing
سال: 2020
ISSN: 1432-7643,1433-7479
DOI: 10.1007/s00500-020-05043-y